/**
*      author: Y_Yao
*      created: 2025-02-12 12:05:00
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int a[N],c[N],b[N];
int n,m;

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        c[i] = a[i];
    }
    for(int i = 1;i <= m;i++)
    {
        cin >> b[i];
    }
    set<int> s(b + 1,b + 1 + m);
    for(int i = 1;i <= n;i++)
    {
        if(i == 1)
        {
            c[i] = min(a[i],*s.begin() - a[i]);
        }
        else 
        {
            //x - a[i] >= c[i-1];
            auto it = s.lower_bound(a[i] + c[i - 1]);
            if(it != s.end())
            {
                //c[i] = min(c[i],*it - a[i]);
                if(a[i] >= c[i-1]) c[i] = min(c[i],*it - a[i]);
                else c[i] = *it - a[i];
            }
        }
    }

    for(int i = 2;i <= n;i++)
    {
        if(c[i] < c[i-1])
        {
            cout << "NO" << endl;
            return;
        }
    }

    cout << "YES" << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}